A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph
نویسندگان
چکیده
منابع مشابه
A linear-time algorithm for finding a complete graph minor in a dense graph
Let g(t) be the minimum number such that every graph G with average degree d(G) ≥ g(t) contains a Kt-minor. Such a function is known to exist, as originally shown by Mader. Kostochka and Thomason independently proved that g(t) ∈ Θ(t√log t). This article shows that for all fixed ǫ > 0 and fixed sufficiently large t ≥ t(ǫ), if d(G) ≥ (2 + ǫ)g(t) then we can find this Kt-minor in linear time. This...
متن کاملA practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کاملA Time Dependent Pollution Routing Problem in Multi-graph
This paper considers a time dependent(the travel time is not constant throughout the day) pollution routing problem (TDPRP), which aids the decision makers in minimizing travel time, toll cost and emitted pollution cost. In complexity of urban areas most of the time one point is accessible from another with more than one edge. In contrast to previous TDPRP models, which are designed with only ...
متن کاملA Linear Time Algorithm for Graph Partition Problems
In this paper we present an O( I V I + I E I) time algorithm which partitions the set of vertices of an undirected graph G = (I’, E) with maximum degree A and minimum degree 6 to {A, x} such that the following hold. (8 The number of edges with one end point in A and the other end point in x is at least IEl/2. (ii> The difference between the number of vertices in A and the number of vertices in ...
متن کاملAn algorithm for finding a maximum clique in a graph
This paper introduces a branch and bound algorithm for the maximumclique problem which applies existing clique nding and vertex coloring heuristics to determine lower and upper bounds for the size of a maximum clique. Computational results on a variety of graphs indicate the proposed procedure in most instances outperforms leading algorithms. and an anonymous referee for their helpful discussio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2013
ISSN: 0895-4801,1095-7146
DOI: 10.1137/120866725